Record-Based Block Distribution (RBBD) and weighted set cover scheduling (WSCS) in MapReduce
نویسندگان
چکیده
منابع مشابه
Differential Privacy via Weighted Sampling Set Cover
Differential privacy is a security guarantee model which widely used in privacy preserving data publishing, but the query result can’t be used in data research directly, especially in high-dimensional datasets. To address this problem, we propose a dimensionality reduction method. The core idea of this method is using a series of lowdimensional datasets to reconstruct a high-dimensional dataset...
متن کاملWeighted geometric set cover problems revisited
We study several set cover problems in low dimensional geometric settings. Specifically, we describe a PTAS for the problem of computing a minimum cover of given points by a set of weighted fat objects. Here, we allow the objects to expand by some prespecified δ-fraction of their diameter. Next, we show that the problem of computing a minimum weight cover of points by weighted halfplanes (witho...
متن کاملExponential-time approximation of weighted set cover
The Set Cover problem belongs to a group of hard problems which are neither approximable in polynomial time (at least with a constant factor) nor fixed parameter tractable, under widely believed complexity assumptions. In recent years, many researchers design exact exponential-time algorithms for problems of that kind. The goal is getting the time complexity still of order O(c), but with the co...
متن کاملExact algorithms and applications for Tree-like Weighted Set Cover
We introduce an NP-complete special case of the Weighted Set Cover problem and show its fixed-parameter tractability with respect to the maximum subset size, a parameter that appears to be small in relevant applications. More precisely, in this practically relevant variant we require that the given collection C of subsets of a some base set S should be “tree-like.” That is, the subsets in C can...
متن کاملQPTAS for Weighted Geometric Set Cover on Pseudodisks and Halfspaces
Weighted geometric set-cover problems arise naturally in several geometric and non-geometric settings (e.g. the breakthrough of Bansal and Pruhs (FOCS 2010) reduces a wide class of machine scheduling problems to weighted geometric set-cover). More than two decades of research has succeeded in settling the (1 + )-approximability status for most geometric set-cover problems, except for some basic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Internet Services and Applications
سال: 2012
ISSN: 1867-4828,1869-0238
DOI: 10.1007/s13174-012-0069-8